Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
571	SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for Add to Reading List Source URL: siam.org Language: English - Date: 2013-09-19 09:13:08 NP-complete problems Approximation algorithm Submodular set function Shortest path problem Bin packing problem Vertex cover Dominating set Independent set Computational complexity theory Theoretical computer science Graph theory Mathematics
572	An Hierarchical Terrain Representation for Approximately Shortest Paths David Mould and Michael C. Horsch Department of Computer Science, University of Saskatchewan, Saskatoon, SK, Canada S7N 5A9 Add to Reading List Source URL: people.scs.carleton.ca Language: English - Date: 2008-08-15 17:38:04 Search algorithms Routing algorithms Game artificial intelligence Network theory Combinatorial optimization Shortest path problem Breadth-first search A* search algorithm Pathfinding Mathematics Theoretical computer science Graph theory
573	Lecture XIV Page 1 “The shortest path between two truths in the real domain passes through the complex domain.” Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-11-21 18:55:28 Operations research Routing algorithms Network flow NP-complete problems Bellman–Ford algorithm Shortest path problem Dynamic programming Flow network Tree Mathematics Theoretical computer science Graph theory
574	To be published at the International Semantic Web Conference (ISWC[removed]The framework will be available for download on November 5, 2010. Signal/Collect: Graph Algorithms for the (Semantic) Web Philip Stutz1 , Abraham Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2010-09-20 15:08:34 Graph coloring Shortest path problem Factor graph Algorithm Vertex Distance Floyd–Warshall algorithm Path decomposition Graph theory Mathematics Theoretical computer science
575	Space-efficient Local Computation Algorithms∗ Noga Alon† Ronitt Rubinfeld‡ Abstract Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2011-10-02 19:00:10 Network theory Analysis of algorithms Probabilistic complexity theory Randomized algorithm Graph coloring Decision tree model Probabilistic method Algorithm Shortest path problem Theoretical computer science Mathematics Applied mathematics
576	CS 330 – Spring 2013, Assignment 3 Problems due at the beginning of class on Thursday, February 28 Late assignments will only be accepted up until 11 AM, Friday, March 1 Question[removed]pts). Chapter 4, Exercise 19, on Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2013-02-15 10:26:56 Graph Minimum spanning tree Tree Pseudoforest Path decomposition Graph theory Mathematics Random graph
577	Journal of Artificial Intelligence Research[removed] Submitted 04/13; published[removed]Learning Optimal Bayesian Networks: A Shortest Path Perspective Add to Reading List Source URL: www.jair.org Language: English - Date: 2013-10-16 20:39:07 Bayesian statistics Statistical models Graphical models Game artificial intelligence Search algorithms Bayesian network A* search algorithm Shortest path problem Directed acyclic graph Graph theory Mathematics Applied mathematics
578	CATALAN ADDENDUM Richard P. Stanley version of 25 May 2013 The problems below are a continuation of those appearing in Chapter 6 of Enumerative Combinatorics, volume 2. Combinatorial interpretations Add to Reading List Source URL: math.mit.edu Language: English - Date: 2013-05-25 20:16:51 Integer sequences Discrete mathematics Catalan number Tree Motzkin number Graph Path Combinatorics Mathematics Enumerative combinatorics
579	Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study Jeremy Franky and Ian P. Gentz and Toby Walshz August 15, 1997 analysis of algorithms, computational complexity, phase tra Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2013-07-29 02:03:45 NP-complete problems Hamiltonian path Shortest path problem NP-complete Asymptotic analysis Graph coloring Graph Computational complexity theory Random graph Graph theory Theoretical computer science Mathematics
580	Combinatorial Reasoning in Information Theory Noga Alon∗ Abstract Combinatorial techniques play a crucial role in the investigation of problems in Information Theory. We describe a few representative examples, focusing Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2009-09-22 15:09:58 Graph coloring NP-complete problems Cartesian product of graphs Lovász number Graph theory Induced path Degeneracy